Fault-Tolerant Total Order Multicast to Asynchronous Groups
نویسندگان
چکیده
While Total Order Broadcast (or Atomic Broadcast) primitives have received a lot of attention, this paper concentrates on Total Order Multicast to Multiple Groups in the context of asynchronous distributed systems in which processes may suffer crash failures. “Multicast to Multiple Groups” means that each message is sent to a subset of the process groups composing the system, distinct messages possibly having distinct destination groups. “Total Order” means that all message deliveries must be totally ordered. This paper proposes a protocol for such a multicast primitive. This protocol is based on two underlying building blocks, namely, Uniform Reliable Multicast and Uniform Consensus. Its design characteristics lie in the two following properties. The first one is a Minimality property, more precisely, only the sender of a message and processes of its destination groups have to participate in the multicast of the message. The second property is a Locality property: no execution of a consensus has to involve processes belonging to distinct groups (i.e., consensus are executed on a “per group” basis). This Locality property is particularly useful when one is interested in using the Total Order Multicast primitive in large scale distributed systems. An improvement that reduces the cost of the protocol is also suggested.
منابع مشابه
Consensus-Based Fault-Tolerant Total Order Multicast
ÐWhile Total Order Broadcast (or Atomic Broadcast ) primitives have received a lot of attention, this paper concentrates on Total Order Multicast to Multiple Groups in the context of asynchronous distributed systems in which processes may suffer crash failures. aMulticast to Multiple Groupso means that each message is sent to a subset of the process groups composing the system, distinct message...
متن کاملFlow Control Schemes for a Fault- Tolerant Multicast Protocol
Fault-tolerant multicast protocols require that transmitted/received messages be kept locally for possible retransmission until certain stability conditions are known to have been satisfied at all the members of the group. In an asynchronous distributed system, with potentially unbounded transmission and message processing delays, the number of such 'unstable' messages at processes may grow ind...
متن کاملTotal Order Multicast to Multiple Groups
We present a fault-tolerant algorithm that ensures total order delivery of messages sent to multiple groups of processes. Our algorithm is a multiple group \gen-uine" multicast algorithm in the sense that (1) any process can send a message to any set of process groups, and (2) only the sender and the receivers of a message take part in the algorithm needed to deliver the message. The correctnes...
متن کاملFault - Tolerant Genuine Atomic Multicast to Multiple
We present a simple fault-tolerant algorithm that ensures total order delivery of messages sent to multiple groups of processes. It is based on one underlying block, namely, uniform consensus. Our algorithm is a multiple group \genuine and lo-cal" multicast algorithm in the sense that any process can send a message to any set of process groups, only the sender of a message and processes of its ...
متن کاملTotal Order Multicast to Multiple
We present a fault-tolerant algorithm which ensures global total order delivery of messages sent to multiple groups of processes. Our algorithm is a multiple group \genuine" multicast algorithm in the sense that (1) any process can send a message to any set of process groups, and (2) only the sender and the receivers of a message take part in the algorithm needed to deliver the message. The cor...
متن کامل